12 research outputs found

    An efficient characterization of submodular spanning tree games

    Get PDF
    Cooperative games form an important class of problems in game theory, where a key goal is to distribute a value among a set of players who are allowed to cooperate by forming coalitions. An outcome of the game is given by an allocation vector that assigns a value share to each player. A crucial aspect of such games is submodularity (or convexity). Indeed, convex instances of cooperative games exhibit several nice properties, e.g. regarding the existence and computation of allocations realizing some of the most important solution concepts proposed in the literature. For this reason, a relevant question is whether one can give a polynomial-time characterization of submodular instances, for prominent cooperative games that are in general non-convex. In this paper, we focus on a fundamental and widely studied cooperative game, namely the spanning tree game. An efficient recognition of submodular instances of this game was not known so far, and explicitly mentioned as an open question in the literature. We here settle this open problem by giving a polynomial-time characterization of submodular spanning tree games

    A Mechanism for the Polarity Formation of Chemoreceptors at the Growth Cone Membrane for Gradient Amplification during Directional Sensing

    Get PDF
    Accurate response to external directional signals is essential for many physiological functions such as chemotaxis or axonal guidance. It relies on the detection and amplification of gradients of chemical cues, which, in eukaryotic cells, involves the asymmetric relocalization of signaling molecules. How molecular events coordinate to induce a polarity at the cell level remains however poorly understood, particularly for nerve chemotaxis. Here, we propose a model, inspired by single-molecule experiments, for the membrane dynamics of GABA chemoreceptors in nerve growth cones (GCs) during directional sensing. In our model, transient interactions between the receptors and the microtubules, coupled to GABA-induced signaling, provide a positive-feedback loop that leads to redistribution of the receptors towards the gradient source. Using numerical simulations with parameters derived from experiments, we find that the kinetics of polarization and the steady-state polarized distribution of GABA receptors are in remarkable agreement with experimental observations. Furthermore, we make predictions on the properties of the GC seen as a sensing, amplification and filtering module. In particular, the growth cone acts as a low-pass filter with a time constant ∼10 minutes determined by the Brownian diffusion of chemoreceptors in the membrane. This filtering makes the gradient amplification resistent to rapid fluctuations of the external signals, a beneficial feature to enhance the accuracy of neuronal wiring. Since the model is based on minimal assumptions on the receptor/cytoskeleton interactions, its validity extends to polarity formation beyond the case of GABA gradient sensing. Altogether, it constitutes an original positive-feedback mechanism by which cells can dynamically adapt their internal organization to external signals

    Stabilizing Weighted Graphs

    No full text
    An edge-weighted graph G is called stable if the value of a maximum-weight matching equals the value of a maximum-weight fractional matching. Stable graphs play an important role in some interesting game theory problems, such as network bargaining games and cooperative matching games, because they characterize instances which admit stable outcomes. Motivated by this, in the last few years many researchers have investigated the algorithmic problem of turning a given graph into a stable one, via edge- and vertex-removal operations. However, all the algorithmic results developed in the literature so far only hold for unweighted instances, i.e., assuming unit weights on the edges of G. We give the first polynomial-time algorithm to find a minimum cardinality subset of vertices whose removal from G yields a stable graph, for any weighted graph G. The algorithm is combinatorial and exploits new structural properties of basic fractional matchings, which may be of independent interest. In contrast, we show that the problem of finding a minimum cardinality subset of edges whose removal from a weighted graph G yields a stable graph, does not admit any constant-factor approximation algorithm, unless P=NP. In this setting, we develop an O(Delta)-approximation algorithm for the problem, where Delta is the maximum degree of a node in G.Non UBCUnreviewedAuthor affiliation: University of WaterlooResearche

    deepGBLUP: joint deep learning networks and GBLUP framework for accurate genomic prediction of complex traits in Korean native cattle

    No full text
    Abstract Background Genomic prediction has become widespread as a valuable tool to estimate genetic merit in animal and plant breeding. Here we develop a novel genomic prediction algorithm, called deepGBLUP, which integrates deep learning networks and a genomic best linear unbiased prediction (GBLUP) framework. The deep learning networks assign marker effects using locally-connected layers and subsequently use them to estimate an initial genomic value through fully-connected layers. The GBLUP framework estimates three genomic values (additive, dominance, and epistasis) by leveraging respective genetic relationship matrices. Finally, deepGBLUP predicts a final genomic value by summing all the estimated genomic values. Results We compared the proposed deepGBLUP with the conventional GBLUP and Bayesian methods. Extensive experiments demonstrate that the proposed deepGBLUP yields state-of-the-art performance on Korean native cattle data across diverse traits, marker densities, and training sizes. In addition, they show that the proposed deepGBLUP can outperform the previous methods on simulated data across various heritabilities and quantitative trait loci (QTL) effects. Conclusions We introduced a novel genomic prediction algorithm, deepGBLUP, which successfully integrates deep learning networks and GBLUP framework. Through comprehensive evaluations on the Korean native cattle data and simulated data, deepGBLUP consistently achieved superior performance across various traits, marker densities, training sizes, heritabilities, and QTL effects. Therefore, deepGBLUP is an efficient method to estimate an accurate genomic value. The source code and manual for deepGBLUP are available at https://github.com/gywns6287/deepGBLUP

    Genomic characterisation of breast fibroepithelial lesions in an international cohort

    No full text
    Fibroepithelial lesions (FELs) are a heterogeneous group of tumours comprising fibroadenomas (FAs) and phyllodes tumours (PTs). Here we used a 16-gene panel that was previously discovered to be implicated in pathogenesis and progression, to characterise a large international cohort of FELs via targeted sequencing. The study comprised 303 (38%) FAs and 493 (62%) PTs which were contributed by the International Fibroepithelial Consortium. There were 659 (83%) Asian and 109 (14%) non-Asian FELs, while the ethnicity of the rest was unknown. Genetic aberrations were significantly associated with increasing grade of PTs, and were detected more in PTs than FAs for MED12, TERT promoter, RARA, FLNA, SETD2, TP53, RB1, EGFR, and IGF1R. Most borderline and malignant PTs possessed ≥ 2 mutations, while there were more cases of FAs with ≤ 1 mutation compared to PTs. FELs with MED12 mutations had significantly higher rates of TERT promoter, RARA, SETD2, EGFR, ERBB4, MAP3K1, and IGF1R aberrations. However, FELs with wild-type MED12 were more likely to express TP53 and PIK3CA mutations. There were no significant differences observed between the mutational profiles of recurrent FAs, FAs with a history of subsequent ipsilateral recurrence or contralateral occurrence, and FAs without a history of subsequent events. We identified recurrent mutations which were more frequent in PTs than FAs, with borderline and malignant PTs harbouring cancer driver gene and multiple mutations. This study affirms the role of a set of genes in FELs, including its potential utility in classification based on mutational profiles

    Association between administration of IL-6 antagonists and mortality among patients hospitalized for COVID-19 : a meta-analysis

    No full text
    IMPORTANCE Clinical trials assessing the efficacy of IL-6 antagonists in patients hospitalized for COVID-19 have variously reported benefit, no effect, and harm. OBJECTIVE To estimate the association between administration of IL-6 antagonists compared with usual care or placebo and 28-day all-cause mortality and other outcomes. DATA SOURCES Trials were identified through systematic searches of electronic databases between October 2020 and January 2021. Searches were not restricted by trial status or language. Additional trials were identified through contact with experts. STUDY SELECTION Eligible trials randomly assigned patients hospitalized for COVID-19 to a group in whom IL-6 antagonists were administered and to a group in whom neither IL-6 antagonists nor any other immunomodulators except corticosteroids were administered. Among 72 potentially eligible trials, 27 (37.5%) met study selection criteria. DATA EXTRACTION AND SYNTHESIS In this prospectivemeta-analysis, risk of biaswas assessed using the Cochrane Risk of Bias Assessment Tool. Inconsistency among trial results was assessed using the I-2 statistic. The primary analysis was an inverse variance-weighted fixed-effects meta-analysis of odds ratios (ORs) for 28-day all-cause mortality. MAIN OUTCOMES AND MEASURES The primary outcome measurewas all-cause mortality at 28 days after randomization. There were 9 secondary outcomes including progression to invasive mechanical ventilation or death and risk of secondary infection by 28 days. RESULTS A total of 10 930 patients (median age, 61 years [range of medians, 52-68 years]; 3560 [33%] were women) participating in 27 trials were included. By 28 days, there were 1407 deaths among 6449 patients randomized to IL-6 antagonists and 1158 deaths among 4481 patients randomized to usual care or placebo (summary OR, 0.86 [95% CI, 0.79-0.95]; P =.003 based on a fixed-effects meta-analysis). This corresponds to an absolute mortality risk of 22% for IL-6 antagonists compared with an assumed mortality risk of 25% for usual care or placebo. The corresponding summary ORs were 0.83 (95% CI, 0.74-0.92; P <.001) for tocilizumab and 1.08 (95% CI, 0.86-1.36; P =.52) for sarilumab. The summary ORs for the association with mortality compared with usual care or placebo in those receiving corticosteroids were 0.77 (95% CI, 0.68-0.87) for tocilizumab and 0.92 (95% CI, 0.61-1.38) for sarilumab. The ORs for the association with progression to invasive mechanical ventilation or death, compared with usual care or placebo, were 0.77 (95% CI, 0.70-0.85) for all IL-6 antagonists, 0.74 (95% CI, 0.66-0.82) for tocilizumab, and 1.00 (95% CI, 0.74-1.34) for sarilumab. Secondary infections by 28 days occurred in 21.9% of patients treated with IL-6 antagonists vs 17.6% of patients treated with usual care or placebo (OR accounting for trial sample sizes, 0.99; 95% CI, 0.85-1.16). CONCLUSIONS AND RELEVANCE In this prospectivemeta-analysis of clinical trials of patients hospitalized for COVID-19, administration of IL-6 antagonists, compared with usual care or placebo, was associated with lower 28-day all-cause mortality
    corecore